A solution approach to the orienteering problem with time windows and synchronisation constraints
نویسندگان
چکیده
منابع مشابه
The Multiconstraint Team Orienteering Problem with Multiple Time Windows
The Orienteering Problem (OP) is a combinatorial routing problem of which the goal is to find a tour that maximises the total score earned by visiting vertices. A set of vertices is given, determined by their coordinates and a score. The pairwise travel times between the vertices are known. The total travel time should not exceed a predetermined time budget. Each vertex can be visited at most o...
متن کاملGenetic Algorithm Solving the Orienteering Problem with Time Windows
Abstract. The Orienteering Problem with Time Windows (OPTW) is a well-known routing problem in which a given positive profit and time interval are associated with each location. The solution to the OPTW finds a route comprising a subset of the locations, with a fixed limit on length or travel time, that maximises the cumulative score of the locations visited in the predefined time intervals. Th...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملLocation-Routing Problem with Fuzzy Time Windows and Traffic Time
The location-routing problem is a relatively new branch of logistics system. Its objective is to determine a suitable location for constructing distribution warehouses and proper transportation routing from warehouse to the customer. In this study, the location-routing problem is investigated with considering fuzzy servicing time window for each customer. Another important issue in this regard ...
متن کاملA fast solution method for the time-dependent orienteering problem
This paper introduces a fast solution procedure to solve 100-node instances of the time-dependent orienteering problem (TD-OP) within a few seconds of computation time. Orienteering problems occur in logistic situations were an optimal combination of locations needs to be selected and the routing between the selected locations needs to be optimized. In the time-dependent variant, the travel tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Heliyon
سال: 2020
ISSN: 2405-8440
DOI: 10.1016/j.heliyon.2020.e04202